lifoQueue
Section: OATH Reference Manual (3O)
Updated: 26 August 1991
Index
Return to Main Contents
NAME
lifoQueue (lifoQueueA, lifoQueueG) - a last-in-first-out ordered queue
SYNOPSIS
#include <oath/lifoQueue.h>
DESCRIPTION
The lifoQueue is a seq such that the objs are inserted and removed in
"Last In, First-Out" order -- that is, the obj at the front of the queue
is the last obj that was inserted into the queue (that has not yet been
removed), and the obj at the end of the queue was the first obj inserted.
DERIVATION
lifoQueue : seq : queue : bag : obj
lifoQueue is an abstract type.
STATIC OPERATIONS
- lifoQueueA lifoQueueA:: isa (objA)
-
lifoQueueA::isa(O) returns O if it is truly a lifoQueue; otherwise it
returns Nil.
MEMBER OPERATIONS
- lifoQueueA lifoQueueA:: insert (objA)
-
LQ.insert(O) inserts O into lifoQueue LQ at the front -- that is, O will be
LQ[0] if it is inserted. Depending upon the type of LQ, O may
fall through or be transformed.
INTERNAL OPERATIONS
SEE ALSO
OATH(3O), seq(3O)
AUTHOR
Brian M. Kennedy (Computer Science Center, Texas Instruments Incorporated)
BUGS
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- DERIVATION
-
- STATIC OPERATIONS
-
- MEMBER OPERATIONS
-
- INTERNAL OPERATIONS
-
- SEE ALSO
-
- AUTHOR
-
- BUGS
-
This document was created by
man2html,
using the manual pages.
Time: 00:37:22 GMT, March 30, 2022